Intersection matrices and the Johnson scheme

نویسنده

  • M. Mohammad-Noori
چکیده

In this paper we introduce a generating function F t sk(v)(z) which is a polynomial in terms of z whose coefficients are some intersection matrices. This provides a uniform framework in which several intersection matrices can be extracted from F t sk(v)(z). Several nice properties of F t sk(v)(z) are derived by applying the operator d/dz and studying the operator zd/dz. In the new framework some well-known identities on intersection matrices arise as natural consequences. As an application two new bases for the Johnson scheme are constructed and the eigenvalues of a family of intersection matrices which contains the adjacency matrices of the Johnson scheme are derived. Finally, we determine the rank of some intersection matrices. AMS Classification: 05B20; 05E30

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection Matrices Revisited

Several intersection matrices of s-subsets versus k-subsets of a v-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known identities appear as natural consequences of this viewpoint; especially, use of the derivative operator d/dz and some related operators reveals some connections betw...

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

On the Security of O-PSI a Delegated Private Set Intersection on Outsourced Datasets (Extended Version)

In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about compone...

متن کامل

Brenstien polynomials and its application to fractional differential equation

The paper is devoted to the study of Brenstien Polynomials and development of some new operational matrices of fractional order integrations and derivatives. The operational matrices are used to convert fractional order differential equations to systems of algebraic equations. A simple scheme yielding accurate approximate solutions of the couple systems for fractional differential equations is ...

متن کامل

CONVERGENCE THEOREMS FOR ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS IN THE INTERMEDIATE SENSE FOR THE MODIFIED NOOR ITERATIVE SCHEME

We study the convergence of the modified Noor iterative scheme for the class of asymptotically pseudocontractive mappings in the intermediate sense which is not necessarily Lipschitzian. Our results improves, extends and unifies the results of Schu [23] and Qin {it et al.} [25].  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009